Convexity of the set of k-admissible functions on a compact Kähler manifold

نویسنده

  • Asma JBILOU
چکیده

We prove in this article using some convex analysis results of A. S. Lewis the log-concavity of spectral elementary symmetric functions on the space of Hermitian matrices, and the convexity of the set of k-admissible functions on compact Kähler manifolds.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On difference sequence spaces defined by Orlicz functions without convexity

In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.  

متن کامل

The General Definition of the Complex Monge-Ampère Operator on Compact Kähler Manifolds

We introduce a wide subclass F(X,ω) of quasi-plurisubharmonic functions in a compact Kähler manifold, on which the complex Monge-Ampère operator is well-defined and the convergence theorem is valid. We also prove that F(X,ω) is a convex cone and includes all quasi-plurisubharmonic functions which are in the Cegrell class.

متن کامل

The study of relation between existence of admissible vectors and amenability and compactness of a locally compact group

The existence of admissible vectors for a locally compact group is closely related to the group's profile. In the compact groups, according to Peter-weyl theorem, every irreducible representation has admissible vector. In this paper, the conditions under which the inverse of this case is being investigated has been investigated. Conditions such as views that are admissible and stable will get c...

متن کامل

Fractal Dimension of Graphs of Typical Continuous Functions on Manifolds

If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of  graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012